The set of unattainable points for the Rational Hermite Interpolation Problem

We describe geometrically and algebraically the set of unattainable points for the Rational Hermite Interpolation Problem (i.e. those points where the problem does not have a solution). We show that this set is a union of equidimensional complete intersection varieties of odd codimension, the number of them being equal to the minimum between the degrees of the numerator and denominator of the problem. Each of these equidimensional varieties can be further decomposed as a union of as many rational (irreducible) varieties as input data points. We exhibit algorithms and equations defining all these objects

Bounds for degrees of syzygies of polynomials defining a grade two ideal

We make explicit the exponential bound on the degrees of the polynomials appearing in the Effective Quillen-Suslin Theorem, and apply it jointly with the Hilbert-Burch Theorem to show that the syzygy module of a sequence of $m$ polynomials in $n$ variables defining a complete intersection ideal of grade two is free, and that a basis of it can be computed with bounded degrees. In the known cases, these bounds improve previous results

Minimal solutions of the rational interpolation problem

We explore connections between the approach of solving the rational interpolation problem via resolutions of ideals and syzygies, and the standard method provided by the Extended Euclidean Algorithm (EEA). As a consequence, we obtain explicit descriptions for solutions of minimal degrees in terms of the degrees of elements appearing in the EEA. This result allows us to describe the minimal degree in a μ-basis of a polynomial planar parametrization in terms of a critical degree arising in the EEA

The set of unattainable points for the Rational Hermite Interpolation Problem

We describe geometrically and algebraically the set of unattainable points for the Rational Hermite Interpolation Problem (i.e. those points where the problem does not have a solution). We show that this set is a union of equidimensional complete intersection varieties of odd codimension, the number of them being equal to the minimum between the degrees of the numerator and denominator of the problem. Each of these equidimensional varieties can be further decomposed as a union of as many rational (irreducible) varieties as input data points. We exhibit algorithms and equations defining all these objects